The Plogi and ACi−1 operators on the polynomial time hierarchy
نویسندگان
چکیده
In [CS-92] we studied the agreement of operators Plogi and ACi−1 acting on NP . In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Σk , Π P k , ∆ P k and Θ P k -classes both operators have the same behaviour, but this coincidence does not seem to be true on other classes included in the PH hierarchy: we give a set A such that, relativized to A, Plogi(Plogj (NP )) is different from ACi−1(Plogj (NP )). As a result of these characterizations we show Plog(Θk ) = Θ P k , an equality that is useful to show lowness properties. In fact, we get easily the Θ-lowness results given by Long and Sheu in [LS-91]. Besides, we clarify the situation of the classes in L 2 for which their membership to L P,Θ 2 was not clear.
منابع مشابه
On Cluster Machines and Function Classes
We consider a special kind of non-deterministic Turing machines. Cluster machines are distinguished by a neighbourhood relationship between accepting paths. Based on a formalization using equivalence relations some subtle properties of these machines are proven. Moreover, by abstraction we gain the machine-independend concept of cluster sets which is the starting point to establish cluster oper...
متن کاملFunction operators spanning the arithmetical and the polynomial hierarchy
A modified version of the classical μ-operator as well as the first value operator and the operator of inverting unary functions, applied in combination with the composition of functions and starting from the primitive recursive functions, generate all arithmetically representable functions. Moreover, the nesting levels of these operators are closely related to the stratification of the arithme...
متن کاملOn Higher Arthur-Merlin Classes
We study higher Arthur-Merlin classes de ned via several natural probabilistic operators BP;R and co-R. We investigate the complexity classes they de ne, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bound...
متن کاملModeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS
The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...
متن کاملRational Ruijsenaars-schneider Hierarchy and Bispectral Difference Operators
Abstract. We show that a monic polynomial in a discrete variable n, with coefficients depending on time variables t1, t2, . . . is a τ -function for the discrete Kadomtsev-Petviashvili hierarchy if and only if the motion of its zeros is governed by a hierarchy of Ruijsenaars-Schneider systems. These τ -functions were considered in [10], where it was proved that they parametrize rank one solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007